Stochastic computing

Results: 157



#Item
21Preprint ANL/MCS-P4030AN AUGMENTED INCOMPLETE FACTORIZATION APPROACH FOR COMPUTING THE SCHUR COMPLEMENT IN STOCHASTIC OPTIMIZATION § ¨

Preprint ANL/MCS-P4030AN AUGMENTED INCOMPLETE FACTORIZATION APPROACH FOR COMPUTING THE SCHUR COMPLEMENT IN STOCHASTIC OPTIMIZATION § ¨

Add to Reading List

Source URL: www.mcs.anl.gov

Language: English - Date: 2013-05-23 14:20:12
22A comparison of variational and Markov Chain Monte Carlo methods for inference in partially observed stochastic dynamic systems. Yuan Shen Neural Computing Research Group Aston University

A comparison of variational and Markov Chain Monte Carlo methods for inference in partially observed stochastic dynamic systems. Yuan Shen Neural Computing Research Group Aston University

Add to Reading List

Source URL: www0.cs.ucl.ac.uk

Language: English - Date: 2011-03-29 16:39:24
    23Image and Vision Computing–364 www.elsevier.com/locate/imavis Fast stochastic optimization for articulated structure tracking M. Bray a,*, E. Koller-Meier a, N.N. Schraudolph b, L. Van Gool a a

    Image and Vision Computing–364 www.elsevier.com/locate/imavis Fast stochastic optimization for articulated structure tracking M. Bray a,*, E. Koller-Meier a, N.N. Schraudolph b, L. Van Gool a a

    Add to Reading List

    Source URL: nic.schraudolph.org

    Language: English - Date: 2011-07-24 10:13:18
      24Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits Yasin Abbasi-Yadkori Dept. of Computing Science University of Alberta

      Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits Yasin Abbasi-Yadkori Dept. of Computing Science University of Alberta

      Add to Reading List

      Source URL: webdocs.cs.ualberta.ca

      Language: English - Date: 2012-02-08 11:48:18
        25Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits Yasin Abbasi-Yadkori Dept. of Computing Science University of Alberta

        Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits Yasin Abbasi-Yadkori Dept. of Computing Science University of Alberta

        Add to Reading List

        Source URL: webdocs.cs.ualberta.ca

        Language: English - Date: 2012-02-08 11:48:18
        26The Power of Two Choices in Randomized Load Balancing by Michael David Mitzenmacher B.A. (Harvard UniversityA dissertation submitted in partial satisfaction of the requirements for the degree of

        The Power of Two Choices in Randomized Load Balancing by Michael David Mitzenmacher B.A. (Harvard UniversityA dissertation submitted in partial satisfaction of the requirements for the degree of

        Add to Reading List

        Source URL: www.eecs.harvard.edu

        Language: English - Date: 2002-01-28 14:08:50
        27The Cloud is the future Internet: How do we engineer a cloud? Jim Roberts Inria, France

        The Cloud is the future Internet: How do we engineer a cloud? Jim Roberts Inria, France

        Add to Reading List

        Source URL: infocom.di.unimi.it

        Language: English - Date: 2013-04-19 04:50:47
        28A Stochastic Model for Reputation Management in Introduction-Based Trust Systems1,2 O. Patrick Kreidl University of North Florida Jacksonville, Florida, U.S.A.

        A Stochastic Model for Reputation Management in Introduction-Based Trust Systems1,2 O. Patrick Kreidl University of North Florida Jacksonville, Florida, U.S.A.

        Add to Reading List

        Source URL: stoch-nets-2012.lids.mit.edu

        Language: English - Date: 2012-06-11 04:38:41
        29Pending Interest Table Sizing in Named Data Networking Giovanna Carofiglio Massimo Gallo  Cisco Systems

        Pending Interest Table Sizing in Named Data Networking Giovanna Carofiglio Massimo Gallo Cisco Systems

        Add to Reading List

        Source URL: conferences2.sigcomm.org

        Language: English - Date: 2015-10-01 13:11:01
        30Gossip Learning with Linear Models on Fully Distributed Data∗ Róbert Ormándi, István Heged˝us, Márk Jelasity University of Szeged and Hungarian Academy of Sciences {ormandi,ihegedus,jelasity}@inf.u-szeged.hu

        Gossip Learning with Linear Models on Fully Distributed Data∗ Róbert Ormándi, István Heged˝us, Márk Jelasity University of Szeged and Hungarian Academy of Sciences {ormandi,ihegedus,jelasity}@inf.u-szeged.hu

        Add to Reading List

        Source URL: www.inf.u-szeged.hu

        Language: English - Date: 2013-02-15 04:43:56